A duality theoretic view on limits of finite structures: Extended version

A Finite-Model-Theoretic View on Propositional Proof Complexity

We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the polynomial calculus of bounded degree, can be characterised in a precise sense by variants of fixed-point logics that are of fundamental import...

A Proof - Theoretic Foundation of Abortive Continuations ( Extended version )

We give an analysis of various classical axioms and characterize a notion of minimal classical logic that enforces Peirce’s law without enforcing Ex Falso Quodlibet. We show that a “natural” implementation of this logic is Parigot’s classical natural deduction. We then move on to the computational side and emphasize that Parigot’s λμ corresponds to minimal classical logic. A continuation consta...

Fuzzy sets form A meta-system-theoretic point of view

Near-Unanimity Polymorphisms on Structures with Finite Duality

We introduce a combinatorial parameter on finite relational trees which measures the smallest possible arity of a near-unanimity polymorphism on a core structure with finite duality.

A Heuristic Method on Extended Two-Stage Network Structures

Data Envelopment Analysis (DEA) as a non–parametric method is used to measure relative performance of organizational units. The aim of this paper is to develop a new model to evaluate the efficiency of a general two-stage network structures proposed by Li et al.  (2012) for measuring the performance of Decision Making Units (DMUs). In addition, this paper expands the work of Li et al. (2012) an...